Privacy Preserving Probabilistic Possibilistic Fuzzy C Means Clustering
نویسندگان
چکیده
Due to this uncontrollable growth of data, clustering played major role to partition into a small sets to do relevant processes within the small sets. Recently, the privacy and security are extra vital essentials when data is large and the data is distributed to other sources for various purposes. According to that, the privacy preservation should be done before distributing the data. In this study, our proposed algorithm meets the both requirements of achieving the clustering accuracy and privacy preserving of the data. Initially, the whole dataset is divided to small segments. The next step is to find the best sets of attributes combinations, which are attained through, attribute weighing process, which leads to attain the privacy preservation through vertical partitioning. The next is to apply the proposed Probabilistic Possibilistic Clustering Algorithm (PPFCM) for each segment, which produces the number of clusters for each segment. The next step is applying the PPFCM on the centroids of the clusters. The corresponding data tuples of the grouped centroids join to attain the final clustered result. The implementation is done using JAVA and the performance of the proposed PPFCM algorithm is compared with possibilistic FCM and probability-clustering algorithm for the benchmark datasets.
منابع مشابه
Several Formulations for Graded Possibilistic Approach to Fuzzy Clustering
Fuzzy clustering is a useful tool for capturing intrinsic structure of data sets. This paper proposes several formulations for soft transition of fuzzy memberships from probabilistic partition to possibilistic one. In the proposed techniques, the free memberships are given by introducing additional penalty term used in Possibilistic c-Means. The new features of the proposed techniques are demon...
متن کاملUnsupervised Approach Data Analysis Based on Fuzzy Possibilistic Clustering: Application to Medical Image MRI
The analysis and processing of large data are a challenge for researchers. Several approaches have been used to model these complex data, and they are based on some mathematical theories: fuzzy, probabilistic, possibilistic, and evidence theories. In this work, we propose a new unsupervised classification approach that combines the fuzzy and possibilistic theories; our purpose is to overcome th...
متن کاملBilateral Weighted Fuzzy C-Means Clustering
Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...
متن کاملA Noise-Resistant Fuzzy C Means Algorithm for Clustering - Fuzzy Systems Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE
Probabilistic clustering techniques use the concept of memberships to describe the degree by which a vector belongs to a cluster. The use of memberships provides probabilistic methods with more realistic clustering than “hard” techniques. However, fuzzy schemes (like the Fuzzy c Means algorithm, FCW are open sensitive to outliers. We review four existing algorithms, devised to reduce this sensi...
متن کاملFuzzy Cluster Centers Separation Clustering Using Possibilistic Approach
Fuzzy c-means (FCM) clustering is based on minimizing the fuzzy within cluster scatter matrix trace but FCM neglects the between cluster scatter matrix trace that controls the distances between the class centroids. Based on the principle of cluster centers separation, fuzzy cluster centers separation (FCCS) clustering is an extended fuzzy c-means (FCM) clustering algorithm. FCCS attaches import...
متن کامل